package dp;

/**
 * Created with IntelliJ IDEA.
 * Description: 343. 整数拆分
 * User: Li_yizYa
 * Date: 2025/7/3
 * Time: 21:12
 */
public class Solution6 {
    public int integerBreak(int n) {
        if (n < 2) {
            return 0;
        }
        int[] dp = new int[n + 1];
        dp[2] = 1;
        for (int i = 3; i <= n; i++) {
            for (int j = 1; j <= i - j; j++) {
                dp[i] = Math.max(dp[i], Math.max(j * (i - j), j * dp[i - j]));
            }
        }
        return dp[n];
    }

}
